Pentagon deposits unpack under gentle tapping
نویسندگان
چکیده
منابع مشابه
ar X iv : 0 71 0 . 16 12 v 1 [ co nd - m at . s of t ] 8 O ct 2 00 7 epl draft Pentagon deposits unpack under gentle tapping
We present results from simulations of regular pentagons arranged in a rectangular die. The particles are subjected to vertical tapping. We study the behavior of the packing fraction, number of contacts and arch distributions as a function of the tapping amplitude. Pentagons show peculiar features as compared with disks. As a general rule, pentagons tend to form less arches than disks. Neverthe...
متن کاملFractal design for efficient brittle plates under gentle pressure loading.
We consider a plate made from an isotropic but brittle elastic material, which is used to span a rigid aperture, across which a small pressure difference is applied. The problem we address is to find the structure which uses the least amount of material without breaking. Under a simple set of physical approximations and for a certain region of the pressure-brittleness parameter space, we find t...
متن کاملDimensionally Regulated Pentagon Integrals?
We present methods for evaluating the Feynman parameter integrals associated with the pentagon diagram in 4 − 2 dimensions, along with explicit results for the integrals with all masses vanishing or with one non-vanishing external mass. The scalar pentagon integral can be expressed as a linear combination of box integrals, up to O( ) corrections, a result which is the dimensionallyregulated ver...
متن کاملDeflating the Pentagon
In this paper we consider deflations (inverse pocket flips) of n-gons for small n. We show that every pentagon can be deflated after finitely many deflations, and that any infinite deflation sequence of a pentagon results from deflating an induced quadrilateral on four of the vertices. We describe a family of hexagons that deflate infinitely for a specific deflation sequence, yet induce no infi...
متن کاملSteiner pentagon covering designs
Let Kn denote the complete undirected graph on n vertices. A Steiner pentagon covering design (SPCD) of order n is a pair (Kn;B), where B is a collection of c(n)= n=5 n−1=2 pentagons from Kn such that any two vertices are joined by a path of length 1 in at least one pentagon of B, and also by a path of length 2 in at least one pentagon of B. The existence of SPCDs is investigated. The main appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2008
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.77.051305